Performance tuning of a multiprocessor sparse matrix equation solver
نویسندگان
چکیده
Solving a system of linear simultaneous equations representing an electrical circuit is one of the most time consuming tasks for large scale circuit simulations. In order to facilitate a multiprocessor implementation of the circuit simulation program SPICE, a decomposit ion algorithm is employed to partition the sparse matrix equution qf an overall circuit into a number of sub-circuit equations for parallel processing. In this paper, various implementation and performance tuning issues of a parallel direct method matrix equation solving routine is reported This routine is written in such a manner that the data structure is compatible with SPICE Version 3CI. The speed-up obtained for the simulation of several test circuits on a message passing multiprocessor system built on Transputers will be reported.
منابع مشابه
WSSMP: A High-Performance Shared- and Distributed-Memory Parallel Sparse Symmetric Linear Equation Solver
The Watson Symmetric Sparse Matrix Package, WSSMP, is a high-performance, robust, and easy to use software package for solving large sparse symmetric systems of linear equations. It can be used as a serial package, or in a shared-memory multiprocessor environment, or as a scalable parallel solver in a message-passing environment, where each node can either be a uniprocessor or a shared-memory m...
متن کاملKSR 1 Multiprocessor: Analysis of Latency Hiding Techniques in a Sparse Solver
This paper analyzes and evaluates some novel latency hiding features of the KSR1 multiprocessor: prefetch and poststore instructions and automatic updates. As a case study, we analyze the performance of an iterative sparse solver which generates irregular communications. We show that automatic updates signiicantly reduce the amount of communication. Although prefetch and poststore instructions ...
متن کاملParallel Computation of 3-d Electromagnetic Scattering Using Finite Elements
The finite element method (FEM) with local absorbing boundary conditions has been recently applied to compute electromagnetic scattering from large 3-D geometries. In this paper, we present details pertaining to code implementation and optimization. Various types of sparse matrix storage schemes are discussed and their performance is examined in terms of vectorization and net storage requiremen...
متن کاملPerformance of a Fully Parallel Sparse Solver
The performance of a fully parallel direct solver for large sparse symmetric positive deenite systems of linear equations is demonstrated. The solver is designed for distributed-memory, message-passing parallel computer systems. All phases of the computation, including symbolic processing as well as numeric factorization and triangular solution, are performed in parallel. A parallel Cartesian n...
متن کاملOSKI: A library of automatically tuned sparse matrix kernels
The Optimized Sparse Kernel Interface (OSKI) is a collection of low-level primitives that provide automatically tuned computational kernels on sparse matrices, for use by solver libraries and applications. These kernels include sparse matrix-vector multiply and sparse triangular solve, among others. The primary aim of this interface is to hide the complex decisionmaking process needed to tune t...
متن کامل